Efficiency of Large Double Auctions
نویسندگان
چکیده
MANY MARKET SETTINGS are approximated by a double auction. Standard examples are the London gold market and the order books maintained by New York Stock Exchange specialists. These auctions typically have many traders on each side of the market. More importantly, large double auctions are an excellent model for microfoundations of price formation in competitive markets. Like a competitive market, a large double auction has many traders. However, unlike the standard competitive model, traders are strategic. Hence, if traders asymptotically ignore their effect on price, this is a result, not an assumption, and there is an explicit mechanism translating individual behaviors into prices. So one of the thorniest problems of the standard Walrasian model—how does the market get to equilibrium if everyone is a price taker—is explicitly addressed. Finally, double auctions are a better setting for thinking about price formation than one-sided auctions, both because they are often a better match to reality and, especially, because they capture the essential problems of trade better than a one-sided auction. A large one-sided auction allows one to ask if traded units end up in the right hands, but it does not address whether the correct number of units trade in the first place. In a seminal paper, Rustichini, Satterthwaite, and Williams (1994, henceforth RSW) consider a double auction in which n buyers and sellers draw private values independently and identically distributed. They show that symmetric, increasing, differentiable equilibria in this setting are in the limit efficient and that convergence is fast, of order 1/n2. This is especially attractive in light of experimental evidence on efficiency in double auctions with only a moderate number of players.2
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملOperational efficiency of decentralized Internet auction mechanisms
The recent consumer-to-consumer (C2C) Internet auction boom at eBay, Yahoo, Amazon, and other sites has added new theoretical challenges to the science of auctions. This paper uses experiments with economically-motivated human subjects to measure the operational efficiency of decentralized Internet auction mechanisms as they compare to centralized double auction mechanisms. Subjects are recruit...
متن کاملTRUST: A General Framework for Truthful Double Spectrum Auctions (Extended)
We design truthful double spectrum auctions where multiple parties can trade spectrum based on their individual needs. Open, market-based spectrum trading motivates existing spectrum owners (as sellers) to lease their selected idle spectrum to new spectrum users, and provides new users (as buyers) the spectrum they desperately need. The most significant challenge is how to make the auction econ...
متن کاملChain: A Dynamic Double Auction Framework for Matching Patient Agents
In this paper we present and evaluate a general framework for the design of truthful auctions for matching agents in a dynamic, two-sided market. A single commodity, such as a resource or a task, is bought and sold by multiple buyers and sellers that arrive and depart over time. Our algorithm, Chain, provides the first framework that allows a truthful dynamic double auction (DA) to be construct...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کامل